Description: 实现聚类K均值算法： K均值算法：给定类的个数K，将n个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。 缺点：产生类的大小相差不会很大，对于脏数据很敏感。 改进的算法：k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用，这样的一个medoid就标识了这个类。步骤： 1，任意选取K个对象作为medoids（O1,O2,…Oi…Ok）。 以下是循环的： 2，将余下的对象分到各个类中去（根据与medoid最相近的原则）； 3，对于每个类（Oi）中，顺序选取一个Or，计算用Or代替Oi后的消耗—E（Or）。选择E最小的那个Or来代替Oi。这样K个medoids就改变了，下面就再转到2。 4，这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感，但计算量显然要比K均值要大，一般只适合小数据量。-achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or) Platform: |
Size: 1024 |
Author:阿兜 |
Hits:
Description: 空间数据分析中最常用的是聚类分析,而K-MEANS算法是聚类分析中常用的,其主要思想是在给定的聚类数目下对多维(我做的是三维空间点)向量进行聚类,-Spatial data analysis is the most commonly used cluster analysis, while the K-MEANS algorithm is commonly used in cluster analysis, the main idea is to set the number of under the multi-dimensional clustering (I make the three-dimensional space-point) vector cluster, Platform: |
Size: 6144 |
Author:tangkezong |
Hits:
Description: K-MEANS算法
输入：聚类个数k，以及包含 n个数据对象的数据库。
输出：满足方差最小标准的k个聚类。
处理流程：
（1） 从 n个数据对象任意选择 k 个对象作为初始聚类中心；
（2） 循环（3）到（4）直到每个聚类不再发生变化为止
（3） 根据每个聚类对象的均值（中心对象），计算每个对象与这些中心对象的距离；并根据最小距离重新对相应对象进行划分；
（4） 重新计算每个（有变化）聚类的均值（中心对象）-K-MEANS algorithm Input: cluster number k, and contains n data object database. Output: the minimum standards to meet the variance k-clustering. Deal flow: (1) a data object from the n choose k object as initial cluster centers (2) cycle (3) to (4) until a change in each cluster is no longer so far (3) according to each Clustering objects mean (central object), calculated for each object with these centers to object distance and in accordance with a minimum distance between a re-division of the corresponding object (4) re-calculated for each (change) clustering of the mean (central object ) Platform: |
Size: 3072 |
Author:快快 |
Hits:
Description: k-means 算法接受输入量 k ；然后将n个数据对象划分为 k个聚类以便使得所获得的聚类满足：同一聚类中的对象相似度较高；而不同聚类中的对象相似度较小。聚类相似度是利用各聚类中对象的均值所获得一个“中心对象”（引力中心）来进行计算的。
Matlab 源代码，以兰花数据集作为测试对象。-k-means algorithm to accept input k then n data object is divided into k-clustering in order to make available to the cluster to meet: the same objects in clustering high similarity and objects in different clustering the similarity smaller. Cluster similarity is the use of the clustering of objects by means of a Platform: |
Size: 3072 |
Author:烈马 |
Hits:
Description: 不同于k均值聚类的k中心聚类，2007年SCIENCE文章Clustering by Passing Messages Between Data Points 中的方法-Unlike k-means clustering of the k cluster centers, in 2007 SCIENCE article, Clustering by Passing Messages Between Data Points of the Method Platform: |
Size: 16384 |
Author:puguji |
Hits:
Description: K-meansK均值聚类在无监督的情况下选择图像特征的算法-K-meansK means clustering in the case of unsupervised image feature selection algorithm Platform: |
Size: 46080 |
Author:renli |
Hits:
Description: 均值为K的聚类算法，是一种对聚类数据进行的最简单的算法，广泛应用在各种场合中。-K mean clustering algorithm for clustering data is the most simple algorithm, widely used in various occasions. Platform: |
Size: 48128 |
Author:sunjianqing |
Hits:
Description: k 均值聚类算法 ，能有效的将数据分成k类
但是具有k参数难以确定的缺点。
-k-means algorithm can cluster data into K class but, the parameter K can not be selected easily. Platform: |
Size: 5120 |
Author:cluster |
Hits:
Description: The number of states in GMM as the generative model of the frames is obtained using
k-means algorithm. This also helps to initialize the mean vector and the covariance
matrix of the individual state of the GMM. The training LPC frames collected from
three speech segments are subjected to PCA for dimensionality reduction and are
subjected to k-means algorithm. The total number of frames is equal to the total
number of vectors that are subjected to k-means clustering. Platform: |
Size: 728064 |
Author:Khan17
|
Hits:
Description: K-means聚类算法的matlab实现(k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.) Platform: |
Size: 1024 |
Author:invoker`Z |
Hits:
Description: 根据网上基于划分法k-means的聚类算法，我做了改进。可以预设一个最大的类数和一个半径，自动划分合适的类。最终将随机三维点云聚类完成后显示为不同颜色。(According to the clustering algorithm based on partition K-means on the Internet, I improved it. A maximum number of classes and a radius can be preset to automatically divide appropriate classes. Finally, the random 3D point cloud will be displayed in different colors after clustering.) Platform: |
Size: 1024 |
Author:woyaokaobo |
Hits:
Search - k mean clustering in matlab